The Chinese Postman Problem in Regular Graphs of Odd Degree
نویسندگان
چکیده
The Chinese Postman Problem in a graph is the problem of finding a shortest closed walk traversing all the edges. In a (2r + 1)-regular graph, the problem is equivalent to finding a smallest spanning subgraph in which all vertices have odd degree. We establish a sharp upper bound for the solution in 3-regular graphs, characterize when equality holds, and conjecture the answer for general r.
منابع مشابه
Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs
The Chinese Postman Problem in a multigraph is the problem of finding a shortest closed walk traversing all the edges. In a (2r + 1)-regular multigraph, the problem is equivalent to finding a smallest spanning subgraph in which all vertices have odd degree. In 1994, Kostochka and Tulai established a sharp upper bound for the solution. In this paper, we give simple proofs of their bounds for 3-r...
متن کاملBalloons, Chinese Postman Problem and Cycle Double Cover in Cubic Graphs
We previously determined the minimum size of a maximum matching in a connected (2r + 1)-regular graph with n vertices; the extremal graphs have cut-edges. In this paper, we prove a lower bound for the minimum size of a maximum matching in a t-edge-connected r-regular graph with n vertices, for t ≥ 2 and r ≥ 4. The bound is sharp infinitely often and improves a recent result of Henning and Yeo. ...
متن کاملChinese Postman Problem on Edge-Colored Multigraphs
It is well-known that the Chinese Postman Problem on undirected and directed graphs is polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in sharp contrast to the Chinese Postman Problem on mixed graphs, i.e., graphs with directed and undirected edges, for which the problem is NP-hard.
متن کاملUndirected distances and the postman-structure of graphs
We present some properties of the distance function and of shortest paths in + l-weighted undirected graphs. These extend some basic results, e.g., on matchings, on the Chinese postman problem, and on plane multicommodity flows. Furthermore, distances turn out to be efficient tools to generalize the matching-structure of graphs to a structure related to subgraphs having only parity constraints ...
متن کاملNew results on the Windy Postman Problem
In this paper we study the Windy Postman Problem. This is a well known Arc Routing Problem which contains the Mixed Chinese Postman Problem as a special case. We present here a full description of the polyhedron associated to the Windy Postman Problem over graphs with up to 4 vertices and 10 edges. We introduce two new families of facet-inducing inequalities and we prove that these inequalities...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011